Spatial Sound Localization via Multipath Euclidean Distance Matrix Recovery
نویسندگان
چکیده
منابع مشابه
Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming
Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP) is to find the unspecified elements of A that make A a Euclidean distance matrix (EDM). In this paper, we follow the successful approach in [20] and solve the EDMCP by generalizing the completion problem to allow for approximate completions. In particular, we introdu...
متن کاملEuclidean distance matrix completion problems
A Euclidean distance matrix is one in which the (i, j) entry specifies the squared distance between particle i and particle j. Given a partially-specified symmetric matrix A with zero diagonal, the Euclidean distance matrix completion problem (EDMCP) is to determine the unspecified entries to make A a Euclidean distance matrix. We survey three different approaches to solving the EDMCP.We advoca...
متن کاملRecovering Euclidean Distance Matrices via Landmark MDS
In network topology discovery, it is often necessary to collect measurements between network elements without injecting large amounts of traffic into the network. A possible solution to this problem is to actively query the network for some measurements and use these to infer the remaining ones. We frame this as a particular version of the Noisy Matrix Completion problem where the entries refle...
متن کاملDimensionality Reduction via Euclidean Distance Embeddings
This report provides a mathematically thorough review and investigation of Metric Multidimensional scaling (MDS) through the analysis of Euclidean distances in input and output spaces. By combining a geometric approach with modern linear algebra and multivariate analysis, Metric MDS is viewed as a Euclidean distance embedding transformation that converts between coordinate and coordinate-free r...
متن کاملIterative Spatial Probability Based Sound Localization
A two-dimensional sound localization system using an iterative spatial probability (ISP) algorithm is proposed. With the ISP algorithm, sound signals from two microphones are iteratively crosscorrelated and the time index of the strongest correlation is recorded in a histogram. This information is then used to create a spatial probability map, which makes it possible to accommodate any number o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Selected Topics in Signal Processing
سال: 2015
ISSN: 1932-4553,1941-0484
DOI: 10.1109/jstsp.2015.2422677